Sparse Matrix Computations on Bulk Synchronous Parallel Computers
ثبت نشده
چکیده
The Bulk Synchronous Parallel (BSP) programming model is studied in the context of sparse matrix computations. As a case study, a BSP algorithm is developed for sparse Cholesky factorisation.
منابع مشابه
Sparse Matrix Computations on Bulk Synchronous Parallel Computers
The Bulk Synchronous Parallel (BSP) programming model is studied in the context of sparse matrix computations. As a case study, a BSP algorithm is developed for sparse Cholesky factorisation.
متن کاملScientiic Computing on Bulk Synchronous Parallel Architectures
Bulk synchronous parallel architectures o er the prospect of achieving both scalable parallel performance and architecture independent parallel software. They provide a robust model on which to base the future development of general purpose parallel computing systems. In this paper we theoretically and experimentally analyse the e ciency with which a wide range of important scienti c computatio...
متن کاملScientific Computing on Bulk Synchronous Parallel Architectures
Bulk synchronous parallel architectures offer the prospect of achieving both scalable parallel performance and architecture independent parallel software. They provide a robust model on which to base the future development of general purpose parallel computing systems. In this paper we theoretically and experimentally analyse the efficiency with which a wide range of important scientific comput...
متن کاملScientiic Computing on Bulk Synchronous Parallel Architectures
Bulk synchronous parallel BSP architectures o er the prospect of achieving both scalable parallel performance and architecture independent parallel software They pro vide a robust model on which to base the future development of general purpose parallel computing systems In this paper we theoretically and experimentally analyse the e ciency with which a wide range of important scienti c computa...
متن کاملBasic Sparse Matrix Computations on Massively Parallel Computers ∗
This paper presents a preliminary experimental study of the performance of basic sparse matrix computations on the CM-200 and the CM-5. We concentrate on examining various ways of performing general sparse matrix-vector operations and the basic primitives on which these are based. We compare various data structures for storing sparse matrices and their corresponding matrix – vector operations. ...
متن کامل